Partial Evaluation of Queries for Bit-Sliced Signature Files

نویسندگان

  • Seyit Kocberber
  • Fazli Can
چکیده

Our research extends the bit-sliced signature organization by introducing a partial evaluation approach for queries. The partial evaluation approach minimizes the response time by using a subset of the on-bits of the query signature. A new signature file optimization method, Partially evaluated Bit-Sliced Signature File (P-BSSF), for multi-term query environments using the partial evaluation approach is introduced. The analysis shows that, with 14% increase in space overhead, P-BSSF provides a query processing time improvement of more than 85% for multi-term query environments with respect to the best performance of the bit-sliced signature file (BSSF) method. Under the sequentiality assumption of disk blocks, P-BSSF provides a desirable response time of 1 second for a database size of one million records with a 28% space overhead. Due to partial evaluation, the desirable response time is guaranteed for queries with several terms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vertical Framing of Superimposed Signature Files Using Partial Evaluation of Queries

A new signature file method, Multi-Frame Signature File (MFSF), is introduced by extending the bit-sliced signature file method. In MFSF, a signature file is divided into variable sized vertical frames with different on-bit densities to optimize the response time using a partial query evaluation methodology. In query evaluation the on-bits of the lower onbit density frames are used first. As th...

متن کامل

Bit-Sliced Signature Files for Very Large Text Databases an a Parallel Machine Architecture

Free text retrieval is an important problem which can signii-cantly beneet from a parallel architecture. Signature methods have been proposed to answer text retrieval queries in parallel machines Sta88, LF92], under the assumption that the main memory is suucient to hold the entire signature le. We propose the use of a Parallel Bit-Sliced Signature File method on a SIMD machine architecture whe...

متن کامل

Bit-Sliced Signature Files for Very Large Text Databases on a Parallel Machine Architecture

Free text retrieval is an important problem which can signii-cantly beneet from a parallel architecture. Signature methods have been proposed to answer text retrieval queries in parallel machines Sta88, LF92], under the assumption that the main memory is suucient to hold the entire signature le. We propose the use of a Parallel Bit-Sliced Signature File method on a SIMD machine architecture whe...

متن کامل

Comparing inverted files and signature files for searching a large lexicon

Signature files and inverted files are well-known index structures. In this paper we undertake a direct comparison of the two for searching for partially-specified queries in a large lexicon stored in main memory. Using n-grams to index lexicon terms, a bit-sliced signature file can be compressed to a smaller size than an inverted file if each n-gram sets only one bit in the term signature. Wit...

متن کامل

Slicing the Dimensionality: Top-k Query Processing for High-Dimensional Spaces

Top-k (preference) queries are used in several domains to retrieve the set of k tuples that more closely match a given query. For high-dimensional spaces, evaluation of top-k queries is expensive, as data and space partitioning indices perform worse than sequential scan. An alternative approach is the use of sorted lists to speed up query evaluation. This approach extends performance gains when...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 60  شماره 

صفحات  -

تاریخ انتشار 1996